Two-state two-symbol probabilistic automata
نویسندگان
چکیده
منابع مشابه
Two-State Two-Symbol Probabilistic Automata
In this paper, we discuss the algebraic treatments of probabilistic automata with two states. We derive the result that the matrix product corresponding to a given input tape can be decomposed into the sum of a finite number of fundamental matrices which are determined by the matrices corresponding to the input symbols. We introduced the new concept of probabilistic automata completely isolated...
متن کاملTwo Recursively Inseparable Problems for Probabilistic Automata
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not. A numberless probabilistic automaton can be instantiated into a probabilistic automaton by specifying the exact values of the non-zero probabilistic transit...
متن کاملFinite State Automata Representing Two-Dimensional Subshifts
A new type of two-dimensional automaton has been defined to recognize a class of twodimensional shifts of finite type having the property that every admissible block found within the related local picture language can be extended to a point of the subshift. Here it is shown that this automaton accurately represents the image of the represented twodimensional shift of finite type under a block c...
متن کاملProbabilistic teleportation of two - particle entangled state
In this report, two different probabilistic teleportations of a two-particle entangled state by pure entangled three-particle state are shown. Their successful probabilities are different. 03.65.Bz, 03.67.-a Typeset using REVTEX ∗E-mail: [email protected] †E-Mail: [email protected] 1 Quantum teleportation, proposed by Bennett et.al [1], is the process that transmits an unknown two-state particl...
متن کاملProbabilistic Self-Stabilization with Two-State Machines
We present and prove the correctness of a probabilistic self-stabilizing algorithm that circulates a token around an asynchronous ring of identical two-state machines. The number of machines in the ring is odd, and communication is unidirectional. If the initial state of the ring has more than one token, execution of the algorithm results probabilistically in convergence to a state with one tok...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1970
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(70)90114-2